Compact roundtrip routing with topology-independent node names

Scalable Internet Routing on Topology-Independent Node Identities

Unmanaged Internet Protocol (UIP) is a fully selforganizing network-layer protocol that implements scalable identity-based routing. In contrast with addressbased routing protocols, which depend for scalability on centralized hierarchical address management, UIP nodes use a flat namespace of cryptographic node identifiers. Node identities can be created locally on demand and remain stable across...

Name-independent compact routing in trees

Let G be a graph with nodes {0, . . . , n−1} and positive edge weights. The compact routing problem is to design sublinear-sized routing tables and functions so that when a packet labeled with destination t arrives at node i, i consults its local routing table, optionally rewrites the packet header, and then forwards the packet along an outgoing edge determined by the routing function. The rout...

Link Independent and Node Independent Algorithms for Efficient Multipath Routing

Link-independent and node-independent DAGs satisfy the property that any path from a source to the root on one DAG is link-disjoint (node-disjoint) with any path from the source to the root on the other DAG. To achieve resilient multipath routing, first introduce the concept of independent directed acyclic graphs (IDAGs). For a given a network, we develop polynomialtime algorithms to compute li...

Route: Routing on Names

One of the crucial building blocks for Information Centric Networking (ICN) is a name based routing scheme that can route directly on content names instead of IP addresses. However, moving the address space from IP addresses to content names brings the scalability issues to a whole new level, due to two reasons. First, name aggregation is not as trivial a task as the IP address aggregation in B...

Compact Routing